Á¤º¸°úÇÐȸ ÄÄÇ»ÆÃÀÇ ½ÇÁ¦ ³í¹®Áö (KIISE Transactions on Computing Practices)
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
ÃÖÀå °øÅë ºÎºÐ ¼ö¿À» ÀÌ¿ëÇÑ ¹Ýº¹ µ¿ÀÛ °ËÃâ ±â¹ý |
¿µ¹®Á¦¸ñ(English Title) |
Technique for Detecting Repetitive Motion Using the Longest Common Subsequence |
ÀúÀÚ(Author) |
½ÅÀ±Ã¶
ÀÓÈ¿»ó
YoonCheol Shin
Hyo-Sang Lim
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 49 NO. 04 PP. 0250 ~ 0255 (2022. 04) |
Çѱ۳»¿ë (Korean Abstract) |
ÃÖÀå °øÅë ºÎºÐ ¼ö¿(Longest Common Subsequence, LCS)À» ÀÌ¿ëÇÏ¿© ¿îµ¿ µ¿ÀÛ µ¿¿µ»ó¿¡¼ ½ÃÀÛÁ¡ÀÌ ºÒºÐ¸íÇÑ ¹Ýº¹ µ¿ÀÛÀ» °ËÃâÇÏ´Â ¹æ¹ýÀ» Á¦¾ÈÇÑ´Ù. ±âÁ¸¿¡ ¿¬±¸µéÀº ¿îµ¿ µ¿ÀÛÀÌ ¹Ì¸® Á¤ÇØÁ® Àְųª µ¥ÀÌÅÍ¿¡ ³ëÀÌÁî°¡ ¾ø´Â »óȲ¸¸À» °í·ÁÇÏ¿´´Ù. º» ³í¹®Àº ¿îµ¿ µ¿ÀÛÀÌ ¹Ì¸® Á¤ÀǵǾî ÀÖÁö ¾Ê°í µ¥ÀÌÅÍ¿¡ ³ëÀÌÁî°¡ Á¸ÀçÇÏ´Â »óȲÀ» °¡Á¤ÇÑ´Ù. ÀÌ·¯ÇÑ »óȲÀ» ´Ù·ç±â À§ÇØ ´ëºÎºÐ ¿îµ¿ÀÇ ½ÃÀÛ µ¿ÀÛ°ú ³¡ µ¿ÀÛÀÌ °°´Ù´Â °Í¿¡ Âø¾ÈÇÏ¿© LCS¸¦ ÀÌ¿ëÇÏ¿© ¹Ýº¹ ÆÐÅÏÀ» °ËÃâÇÑ´Ù. ½ÇÁ¦ µ¥ÀÌÅ͸¦ È°¿ëÇÏ¿© ½ÇÇèÀ» ¼öÇàÇÏ°í Á¦¾ÈÇÏ´Â ¹æ¹ýÀÌ ¹Ýº¹ ÆÐÅÏÀ» ³ôÀº Á¤È®µµ·Î °ËÃâÇÒ ¼ö ÀÖÀ½À» º¸ÀδÙ. |
¿µ¹®³»¿ë (English Abstract) |
We propose a technique exploiting the longest common subsequence (LCS) for detecting repetitive motion where the starting position of the motion is not known. Compared to the existing techniques, which only handle predefined motions with no noise, our technique considers the situation where motions are not predefined or known in advance, and the data include noises. We focus on the fact that most repetitive exercise motions include the same start and end patterns and use LCS to detect such repetitive patterns. Through experiments with real motion data, we show that our proposed technique can detect repetitive motions with high accuracy. |
Å°¿öµå(Keyword) |
½Ã°è¿
ÆÐÅÏ °ËÃâ
ÆÐÅÏ Ä«¿îÆ®
ÃÖÀå °øÅë ºÎºÐ ¼ö¿
time series
pattern detecting
pattern count
longest common subsequence
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|